A bounded search tree algorithm for parameterized face cover
نویسندگان
چکیده
منابع مشابه
A bounded search tree algorithm for parameterized face cover
The parameterized complexity of the FACE COVER problem is considered. The input to this problem is a plane graph G with n vertices. The question asked is whether, for a given parameter value k, there exists a set of k or fewer faces whose boundaries collectively cover (contain) every vertex in G. Early attempts achieved run times of O∗(12k) or worse, by reducing the problem into a special form ...
متن کاملAsymptotically Faster Algorithms for Parameterized FACE COVER
The parameterized complexity of the face cover problem is considered. The input to this problem is a plane graph, G, of order n. The question asked is whether, for any fixed k, there exists a set of k or fewer vertices whose boundaries collectively cover (contain) every vertex in G. The fastest previously-published face cover algorithm is achieved with the bounded search tree technique, in whic...
متن کاملTree Cover Search Algorithm for Example-Based Translation
Efficient tree-cover search is essential for the realization of practical example-based translation systems. This paper presents an efficient algorithm for finding the optimum combination of translation examples that covers the whole input tree based on the dynamic-programming technique.
متن کاملGeneralized Bounded Tree Cover of a Graph
A tree cover of a graph is a collection of subgraphs such that each vertex is a part of at least one subgraph and each subgraph is a tree. The bounded tree cover problem (BTC) finds a tree cover with minimum number of trees of bounded weight. This paper considers several generalized versions of BTC. The first problem deals with graphs having multiple metric weight functions. Strong and weak tre...
متن کاملAsymptotically Faster Algorithms for the Parameterized face cover Problem
The parameterized complexity of the face cover problem is considered. The input to this problem is a plane graph, G, of order n. The question asked is whether, for any fixed k, there exists a set of k or fewer vertices whose boundaries collectively cover (contain) every vertex in G. The fastest previously-published face cover algorithm is achieved with the bounded search tree technique, in whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.07.004